Gödel Form of Fuzzy Transitive Relations

نویسندگان

  • ISMAT BEG
  • SAMINA ASHRAF
چکیده

The concepts of fuzzy transitivity of a fuzzy relation on a given universe and the measure of fuzzy transitivity are studied with the use of Gödel fuzzy implicator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy number-valued fuzzy ‎relation

It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...

متن کامل

Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

The property of transitivity is one of the most important for fuzzy binary relations, especially in the cases when they are used for the representation of real life similarity or ordering information. As far as the algorithmic part of the actual calculation of the transitive closure of such relations is concerned, works in the literature mainly focus on crisp symmetric relations, paying little ...

متن کامل

Fuzzy Neutrosophic Equivalence Relations

This paper introduces the concept of fuzzy neutrosophic equivalence relations and discuss some of their properties. define fuzzy neutrosophic transitive closure and investigate their properties.

متن کامل

Representation of Fuzzy Symmetric Relations

The representation theorem Cor F-transitive fuzzy relations is used to prove that the set of reflexive, symmetric and F -transitive fuzzy relations on a set X, F being an Archimedean t-norm, is dense in the set of Ztransitive relations on X. It is also shown that any similarity relation can be represented as a limit of a sequence of transitive relations with respect to Archimedean t-norms.

متن کامل

A New Algorithm to Compute Low T-Transitive Approximation of a Fuzzy Relation Preserving Symmetry. Comparisons with the T-Transitive Closure

It is given a new algorithm to compute a lower T-transitive approximation of a fuzzy relation that preserves symmetry. Given a reflexive and symmetric fuzzy relation, the new algorithm computes a T-indistinguishability that is contained in the fuzzy relation. It has been developed a C++ program that generates random symmetric fuzzy relations or random symmetric and reflexive fuzzy relations and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012